FPTAS for half-products minimization with scheduling applications
نویسندگان
چکیده
منابع مشابه
FPTAS for half-products minimization with scheduling applications
A special class of quadratic pseudo-boolean functions called “half-products” (HP) has recently been introduced. It has been shown that HP minimization, while NP-hard, admits a fully polynomial time approximation scheme (FPTAS). In this note, we provide a more efficient FPTAS. We further show how an FPTAS can also be derived for the general case where the HP function is augmented by a problem-de...
متن کاملMinimization of Half-Products
Since Å xi for binary variables, aiiÅ 0 could be assumed without any loss of generality. 2 x i It is well known that finding the minimum of f is an NP-hard problem (Garey and Johnson 1979); it contains, as special cases, the vertex cover, maximum cut, signed-graph balancing and MAX-2SAT problems. Moreover, for the general minimization problem there exists a constant c ú 0 such that the existenc...
متن کاملA FPTAS for Minimizing Positive Half-Product
The problem of minimizing a quadratic function of boolean variables, which we call PHP (positive half-product), is formulated. A fully polynomial time approximation scheme (FPTAS) for PHP is derived. Several NP-hard scheduling problems can be formulated in terms of PHP. In this presentation, we concentrate on a single machine scheduling problem with controllable job processing times to minimize...
متن کاملMinimization of ordered, symmetric half-products
We introduce a class of pseudo-Boolean functions called ordered, symmetric half-products. The class includes a number of well known scheduling problems. We study sets of dominating solutions for minimization of the half-products, and we show their fully polynomial time approximation schemes that use a natural rounding scheme to obtain 2-solutions in O(n/2) time.
متن کاملPositive half-products and scheduling with controllable processing times
We study the single machine scheduling problem with controllable job processing times to minimize a linear combination of the total weighted job completion time and the total weighted processing time compression. We show that this scheduling problem is a positive half-product minimization problem. Positive half-products make up an interesting subclass of half-products and are introduced in this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.01.018